A New NTRU-Type Public-Key Cryptosystem over the Binary Field

As the development of cloud computing and the convenience of wireless sensor netowrks, smart devices are widely used in daily life, but the security issues of the smart devices have not been well resolved. In this paper, we present a new NTRU-type public-key cryptosystem over the binary field. Specifically, the security of our scheme relies on the computational intractability of an unbalanced sparse polynomial ratio problem (DUSPR). Through theoretical analysis, we prove the correctness of our proposed cryptosystem. Furthermore, we implement our scheme using the NTL library, and conduct a group of experiments to evaluate the capabilities and consuming time of encryption and decryption. Our experiments result demonstrates that the NTRU-type public-key cryptosystem over the binary field is relatively practical and effective.     

基于双秘钥的高强度公钥密码体制的研究

该文研究双秘钥公开钥密码体制,它不同于一般的只有一个秘密密钥的公开钥密钥体制,而是使用两个秘密密钥。要攻破它必须同时解决两个数学难题(素因子分解和求离散对数),从而大大增加了破译难度。     

一个安全有效的身份鉴别协议与对应的数字签名方案

本文利用二元一次不定方程和Schnorr身份鉴别协议，构造出一个新的身份鉴别协议，该协议在RSA问题和离散对数问题是难解的假设下是安全的，同时给出了所对应的数字签名方案。     

基于椭圆曲线上EIGamal公钥体制的数字签名方案

论文提出了基于椭圆曲线上EIGamal加密体制的数字签名方案，并出于安全性的考虑进行了一点改动。另外，应用了Tate配对对签名进行验证。     

Ownership-attached unblinding of blind signatures for untraceable electronic cash

In an untraceable electronic cash protocol based on blind signatures, an identified customer can withdraw a blinded electronic cash from the bank and the unblinding operation is adopted by the customer to transform the blinded electronic cash into a valid one. Before performing the operation, the blinded electronic cash is protected well since attackers cannot convert it into a valid electronic cash without the blinding factor corresponding to the operation. However, after unblinding, the electronic cash will suffer from the theft attacks since it is not protected by any security mechanism. This paper introduces a new unblinding operation called ownership-attached unblinding which attaches the identities of a designated payee and a specified transaction to the blinded electronic cash and then produces an ownership-attached electronic cash other than a bare one such that the cash can withstand the theft attacks during the entire transaction because it is valid for the designated payee and the specified transaction only. Furthermore, the proposed scheme does not largely increase the computation cost required for each customer so that it also is a customer efficient protection solution for untraceable electronic cash and especially suitable for mobile clients and smart-card users.     

ID-based threshold decryption secure against adaptive chosen-ciphertext attack

This paper proposes an identity-based threshold decryption scheme IB-ThDec and reduces its security to the Bilinear Diffie-Hellman problem. Compared with previous work, this conceals two pairing computations in the ciphertext validity verification procedure. The formal proof of security of this scheme is provided in the random oracle model. Additionally, we show that IB-ThDec can be applied to the threshold key escrow and the mediated cryptosystems.     

Threshold cryptography based on Asmuth-Bloom secret sharing

In this paper, we investigate how threshold cryptography can be conducted with the Asmuth-Bloom secret sharing scheme and present three novel function sharing schemes for RSA, ElGamal and Paillier cryptosystems. To the best of our knowledge, these are the first provably secure threshold cryptosystems realized using the Asmuth-Bloom secret sharing. Proposed schemes are comparable in performance to earlier proposals in threshold cryptography.     

RSA公钥算法的新探讨及改进

众所周知,RSA是唯一一个能够同时实现数据加密、数字签名、秘钥交换的算法。其过程可简述为选取两个大的质数乘积n=p’q（非公开）,然后选择一个和牵（n）互质的整数e（其中1〈e〈（b（n））,求其关于欧拉函数巾（n）=（p-1）（q-1）=φ（P）＊φ（q）的逆元d,进而得到公钥对与私钥对（e,n）和（d,n）。假如n是三个或更多素数的乘积会怎样？该算法是否依然成立？本文旨在探讨n取更多素数乘积时所得到的结论以及根据这些结论所能对RSA作出的改进。     

多重不确定的密码体制研究

针对现有密码体制中只有密钥不确定的特点,文章提出了多重不确定密码体制的概念,指出了可能实现的一些途径。文章分析了其优势,指出这类密码体制在大大增强安全性的同时,其可能带来的运算量的增加是可以忽略的。     

Beller-Yacobi协议的研究与模拟实现

本文着重分析了Beller-Yacobi协议及以其中用到的RSA加解密及签名算法,并以RSA加解密算法为例在.NET环境下使用C#语言模拟实现了其详细过程,最终实现了整个Beller-Yacobi密钥传输协议的过程。